Bézout Orders and Henselization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bézout Identities Associated to a Finite Sequence

We consider finite sequences s ∈ D n where D is a commutative, unital, integral domain. We prove three sets of identities (possibly with repetitions), each involving 2n polynomials associated to s. The right-hand side of these identities is a recursively-defined (non-zero) 'product-of-discrepancies'. There are implied iterative algorithms (of quadratic complexity) for the left-hand side coeffic...

متن کامل

Voting and different ranking orders in DEA

Data Envelopment Analysis (DEA) technique now widely use for efficiency evaluation of a set of Decision Making Units (DMUs). As regards of the necessity for ranking efficient units different DEA models presented each of which has advantages and rank efficient units from special aspects. Note that all the existing ranking models have disadvantages, as well and there is not a model in which all t...

متن کامل

Bézout rings with almost stable range 1 Warren

Elementary divisor domains were defined by Kaplansky [I. Kaplansky, Elementary divisors and modules, Trans. Amer. Math. Soc. 66 (1949) 464–491] and generalized to rings with zero-divisors by Gillman and Henriksen [L. Gillman, M. Henriksen, Some remarks about elementary divisor rings, Trans. Amer. Math. Soc. 82 (1956) 362–365]. In [M.D. Larsen, W.J. Lewis, T.S. Shores, Elementary divisor rings a...

متن کامل

Converse Lagrange Theorem Orders and Supersolvable Orders

For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...

متن کامل

Minimizing multi-homogeneous Bézout numbers by a local search method

Consider the multi-homogeneous homotopy continuation method for solving a system of polynomial equations. For any partition of variables, the multi-homogeneous Bézout number bounds the number of isolated solution curves one has to follow in the method. This paper presents a local search method for finding a partition of variables with minimal multi-homogeneous Bézout number. As with any other l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1995

ISSN: 0021-8693

DOI: 10.1006/jabr.1995.1094